Improving the LP bound of a MILP by dual concurrent branching and the relationship to cut generation methods
نویسنده
چکیده
In this paper branching for attacking MILP is investigated. Under certain circumstances branches can be done concurrently. By introducing a new calculus it is shown there are restrictions for dual values. As a second result of this study a new class of cuts for MILP is found, which are defined by those values. This class is a superclass of all other classes of cuts. Furthermore the restrictions of the dual values can be used for studying the addition of arbitrary inequalities. This theory has similarities but also big differences to the theory of disjunctive programming.
منابع مشابه
Improving the LP bound of a MILP by branching concurrently
In this paper the branching trees for attacking MILP are reviewed. Under certain circumstances branches can be done concurrently. This is fully investigated with the result that there are restrictions for certain dual values and reduced costs. As a sideeffect of this study a new class of cuts for MILP is found, which are defined by those values. 1 Motivation of the following thoughts Nowadays t...
متن کاملSubmodular Minimization in the Context of Modern LP and MILP Methods and Solvers
We consider the application of mixed-integer linear programming (MILP) solvers to the minimization of submodular functions. We evaluate common large-scale linear-programming (LP) techniques (e.g., column generation, row generation, dual stabilization) for solving a LP reformulation of the submodular minimization (SM) problem. We present heuristics based on the LP framework and a MILP solver. We...
متن کاملImproving Strong Branching by Propagation
Strong branching is an important component of most variable selection rules in branchand-bound based mixed-integer linear programming solvers. It predicts the dual bounds of potential child nodes by solving auxiliary LPs and thereby helps to keep the branchand-bound tree small. In this paper, we describe how these dual bound predictions can be improved by including domain propagation into stron...
متن کاملUsing Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems
We present a column-generation model and branch-and-price-and-cut algorithm for origin-destination integer multicommodity flow problems. The origin-destination integer multicommodity flow problem is a constrained version of the linear multicommodity flow problem in which flow of a commodity (defined in this case by an origin-destination pair) may use only one path from origin to destination. Br...
متن کاملPrimal and dual robust counterparts of uncertain linear programs: an application to portfolio selection
This paper proposes a family of robust counterpart for uncertain linear programs (LP) which is obtained for a general definition of the uncertainty region. The relationship between uncertainty sets using norm bod-ies and their corresponding robust counterparts defined by dual norms is presented. Those properties lead us to characterize primal and dual robust counterparts. The researchers show t...
متن کامل